Mixed Task Scheduling Using Synthetic Utilization
نویسندگان
چکیده
منابع مشابه
Mixed-Criticality Scheduling of Sporadic Task Systems
We consider the scheduling of mixed-criticality task systems, that is, systems where each task to be scheduled has multiple levels of worst-case execution time estimates. We design a scheduling algorithm, EDF-VD, whose effectiveness we analyze using the processor speedup metric: we show that any 2-level task system that is schedulable on a unit-speed processor is correctly scheduled by EDF-VD u...
متن کاملFrom Heterogeneous Task Scheduling to Heterogeneous Mixed Parallel Scheduling
Mixed-parallelism, the combination of dataand taskparallelism, is a powerful way of increasing the scalability of entire classes of parallel applications on platforms comprising multiple compute clusters. While multi-cluster platforms are predominantly heterogeneous, previous work on mixed-parallel application scheduling targets only homogeneous platforms. In this paper we develop a method for ...
متن کاملImprove Resource Utilization by Task Scheduling in Cluster Computing
Paralleland distributed computing technique is the solution of many high performance computing requirementsin business purpose and research operations. Since parallel computing became useable numbers scheduling algorithms proposed for performance improvement and resource utilization. In this paper we consider scheduling problem for resource allocation to tasks in cluster computing. In addition ...
متن کاملFault-Tolerant Task Scheduling for Mixed-Criticality Real-Time Systems
Integration of safety-critical tasks with di®erent certi ̄cation requirements onto a common hardware platform has become a growing tendency in the design of real-time and embedded systems. In the past decade, great e®orts have been made to develop techniques for handling uncertainties in task worst-case execution time, quality-of-service, and schedulability of mixedcriticality systems. However, ...
متن کاملCPR: Mixed Task and Data Parallel Scheduling for Distributed Systems
It is well-known that mixing task and data parallelism to solve large computational applications often yields better speedups compared to either applying pure task parallelism or pure data parallelism. Typically, the applications are modeled in terms of a dependence graph of coarse-grain data-parallel tasks, called a data-parallel task graph. In this paper we present a new compile-time heuristi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the Korean Institute of Information and Communication Engineering
سال: 2010
ISSN: 2234-4772
DOI: 10.6109/jkiice.2010.14.10.2277